On degeneracy control in overcomplete ICA

نویسندگان

  • Jesse A. Livezey
  • Alejandro F. Bujan
  • Friedrich T. Sommer
چکیده

Understanding the effects of degeneracy control mechanisms when learning overcomplete representations is crucial for applying Independent Components Analysis (ICA) in machine learning and theoretical neuroscience. A number of approaches to degeneracy control have been proposed which can learn non-degenerate complete representations, however some of these methods can fall into bad local minima when extended to overcomplete ICA. Furthermore, they may have unintended side-effects on the distribution of learned basis elements, which may lead to a biased exploration of the data manifold. In this work, we identify and theoretically analyze the cause of these failures and propose a framework that can be used to evaluate arbitrary degeneracy control mechanisms. We evaluate different methods for degeneracy control in overcomplete ICA and suggest two novel approaches, one of which can learn highly orthonormal bases. Finally, we compare all methods on the task of estimating an overcomplete basis on natural images.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Null-space Algorithm for Overcomplete Independent Component Analysis

Independent component analysis (ICA) is an important method for blind source separation and unsupervised learning. Recently, the method has been extended to overcomplete situation where the number of sources is greater than the number of receivers. Comparing complete ICA and overcomplete ICA in existing literature, one can notice that complete ICA does not assume noise in observations, and the ...

متن کامل

ICA with Reconstruction Cost for Efficient Overcomplete Feature Learning

Independent Components Analysis (ICA) and its variants have been successfully used for unsupervised feature learning. However, standard ICA requires an orthonoramlity constraint to be enforced, which makes it difficult to learn overcomplete features. In addition, ICA is sensitive to whitening. These properties make it challenging to scale ICA to high dimensional data. In this paper, we propose ...

متن کامل

Two Methods for Estimating Overcomplete Independent Component Bases

Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data, e.g. image data. Most algorithms are based on approximations of the likelihood, which leads to computationally heavy procedures. Here we introduce two algorithms that are based on heuristic approximations and estimate an approximate overcomplete basis quite fast. The algorithms ar...

متن کامل

Two Approaches to Estimation of Overcomplete Independent Component Bases

Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data. Here we introduce two algorithms that estimate an approximate overcomplete basis quite fast in a high-dimensional space. The first algorithm is based on an assumption that the basis vectors are randomly distributed in the space, and the second on the gaussianization procedure.

متن کامل

About the Overcompleteness of Coherent State Systems with a Line Bundles Viewpoint

Standart Coherent State Systems have an analysis based on lattices (von Neumanns’s lattices) in terms of wich they are classified, looking at the size of the minimun cell, by: complete, overcomplete and not complete. In this work we analize overcomplete systems with a geometrical viewpoint (holomorphic line-budles). We apply the method to evaluate the degeneracy of the lowest Landau level.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1606.03474  شماره 

صفحات  -

تاریخ انتشار 2016